package arrAndstr;

/*
    100. 相同的树
 */
public class T100 {
    public class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode() {
        }

        TreeNode(int val) {
            this.val = val;
        }

        TreeNode(int val, TreeNode left, TreeNode right) {
            this.val = val;
            this.left = left;
            this.right = right;
        }
    }

    //    public boolean isSameTree(TreeNode p, TreeNode q) {
//        if ((p==null && q==null) || (p!=null && q!=null && p.val==q.val)) {
//            return true;
//        } else {
//            return false;
//        }
//
//        return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
//    }
    public boolean isSameTree(TreeNode p, TreeNode q) {
        if (p == null && q == null) {
            return true;
        } else if ((p ==null && q!=null) || (p!=null && q==null) || (p.val != q.val)){
            return false;
        } else {
            return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
        }
    }
}
